Compiling Process Networks to Interaction Nets

Compiling Process Networks to Interaction Nets

Kahn process networks are a model of computation based on a collection of sequential, deterministic processes that communicate by sending messages through unbounded channels. They are well suited for modelling stream-based computations, but are in no way restricted to this application. Interaction nets are graph rewriting systems that have many interesting properties for implementation. In this...

From Proof-Nets to Interaction Nets

Interaction Schemata: Compiling Interactions to Code

Programming object interactions is at the heart of object-oriented programming. To improve reusability of the interactions, it is important to program object interactions generically. We present two tools that facilitate programming of object interactions. StructureBuilder, a commercial tool, achieves genericity with respect to data structure implementations for collections, following ideas fro...

Compiling the Process Functional Programs

This paper briefly describes process functional language compiler architecture. Process functional language is an experimental functional language with imperative features like memory cell variables. The main parts of the process functional language compiler are presented with short description and examples. Current implementation of PFL compiler comprises a algebraic types, primitive functions...

Macros for Interaction Nets: A Conservative Extension of Interaction Nets

We propose a conservative extension of interaction nets which offers enriched patternmatching facilities. The extension is conservative in the sense that it can be implemented inside standard interaction nets, and thus can be seen as a system of macros. Consequently, we are guaranteed to keep all the good properties of interaction nets, in particular strong confluence. We see this extension as ...